Rational G-matrices with rational eigenvalues
نویسندگان
چکیده
منابع مشابه
Rational and Polynomial Matrices
where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...
متن کاملComputing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic
Powerful algorithms have recently been proposed for computing eigenvalues of large matrices by methods related to contour integrals; best known are the works of Sakurai and coauthors and Polizzi and coauthors. Even if the matrices are real symmetric, most such methods rely on complex arithmetic, leading to expensive linear systems to solve. An appealing technique for overcoming this starts from...
متن کاملRational G Splines
We develop a class of rational, G2-connected splines of degree 3 that allow modeling multiple basic shapes, such as segments of conics and circle arcs in particular, in one structure. This can be used, for example, to have portions of a control polygon exactly reproduce segments of the shapes while other portions blend between these primary shapes. We also show how to reparameterize the splines...
متن کاملStrong Linearizations of Rational Matrices
This paper defines for the first time strong linearizations of arbitrary rational matrices, studies in depth properties and different characterizations of such linear matrix pencils, and develops infinitely many examples of strong linearizations that can be explicitly and easily constructed from a minimal state-space realization of the strictly proper part of the considered rational matrix and ...
متن کاملUnbiased Rounding of Rational Matrices
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph coloring, in scheduling and in statistics. Here, it often is also desirable to round each entry randomly such that the probability of rounding it up equals its fractional part. This is known as unbiased rounding in stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1982
ISSN: 0097-3165
DOI: 10.1016/0097-3165(82)90026-7